Almost Sure Asymptotic Optimality for the Online Traveling Repairman Problem with Precedence Constraints
نویسندگان
چکیده
In this paper we study online algorithms for the online Traveling Repairman Problem (TRP) with precedence constraints. We show that, under general stochastic structures for the problem data, unknown and unused by the online algorithm, many online algorithms for this problem are almost surely asymptotically optimal. We also provide computational results for special cases that show that the convergence can be very fast.
منابع مشابه
Almost sure asymptotic optimality for online routing and machine scheduling problems
In this paper we study algorithms for online routing and machine scheduling problems. The problems are “online” because the problem instances are revealed incrementally. We first study algorithms for the online Traveling Repairman Problem (TRP), where a single server is to visit a set of locations in a network with the objective of minimizing the sum of weighted completion times. We then analyz...
متن کاملOnline Optimization in Routing and Scheduling
In this thesis we study online optimization problems in routing and scheduling. An online problem is one where the problem instance is revealed incrementally. Decisions can (and sometimes must) be made before all information is available. We design and analyze (polynomial-time) online algorithms for a variety of problems. We utilize worst-case competitive ratio (and relaxations thereof), asympt...
متن کاملA Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints a Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
In this article we consider a variant of the classical asymmetric traveling salesman problem (ATSP), namely the ATSP in which precedence constraints require that certain nodes must precede certain other nodes in any feasible directed tour. This problem occurs as a basic model in scheduling and routing and has a wide range of applications varying from helicopter routing 25], sequencing in exible...
متن کاملA Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)
Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP have been suggested. In this paper we propose a cuckoo search algorithm (CSA) for effectively ...
متن کاملPolynomial time approximation schemes for the traveling repairman and other minimum latency problems
We give a polynomial time, (1+ )-approximation algorithm for the traveling repairman problem (TRP) in the Euclidean plane, on weighted planar graphs, and on weighted trees. This improves on the known quasi-polynomial time approximation schemes for these problems. The algorithm is based on a simple technique that reduces the TRP to what we call the segmented TSP. Here, we are given numbers l1, ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006